Correction to: Smooth and Strong PCPs
نویسندگان
چکیده
Authors would like to correct the error in their publication.
منابع مشابه
Robust PCPs of Proximity and Shorter PCPs
Probabilistically Checkable Proofs (PCPs) provide a format of rewriting and verifyingmathematical proofs that allow efficient probabilistic verification based on probing very few bits of the rewritten proof. The celebrated PCP Theorem asserts that probing a constant number of bits suffices (in fact just 3 bits suffice). A natural question that arises in the construction of PCPs is by how much d...
متن کاملSmooth eigenvalue correction
Second-order statistics play an important role in data modeling. Nowadays, there is a tendency toward measuring more signals with higher resolution (e.g., high-resolution video), causing a rapid increase of dimensionality of the measured samples, while the number of samples remains more or less the same. As a result the eigenvalue estimates are significantly biased as described by the Marčenko ...
متن کاملReductions, Codes, PCPs, and Inapproximability
Many recent results show the hardness of approximating NP-hard functions. We formalize, in a very simple way, what these results involve: a code-like Levin reduction. Assuming a well-known complexity assumption, we show that such reductions cannot prove the NP-hardness of the following problems, where is any positive fraction: (i) achieving an approximation ratio n 1=2+ for Clique, (ii) achievi...
متن کاملGROUPOID ASSOCIATED TO A SMOOTH MANIFOLD
In this paper, we introduce the structure of a groupoid associated to a vector field on a smooth manifold. We show that in the case of the $1$-dimensional manifolds, our groupoid has a smooth structure such that makes it into a Lie groupoid. Using this approach, we associated to every vector field an equivalence relation on the Lie algebra of all vector fields on the smooth...
متن کامل5.1 Pcps of Proximity
In today’s lecture we will first define a new variant of PCP, called PCPs of Proximity, and then use this we use to perform ”proof composition”, a necessary ingredient in all existing PCP constructions to reduce the size of the alphabet or equivalently to reduce the query complexity. In fact, proof composition will be one of the phases of Dinur’s proof of the PCP, that we will discuss in the ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Complexity
سال: 2021
ISSN: ['1016-3328', '1420-8954']
DOI: https://doi.org/10.1007/s00037-021-00208-z